Dense resultant of composed polynomials: Mixed-mixed case
نویسنده
چکیده
The main question of this paper is: What is the dense (Macaulay) resultant of composed polynomials? By a composed polynomial f ◦ (g1, . . . , gn), we mean the polynomial obtained from a polynomial f in the variables y1, . . . , yn by replacing yj by by some polynomial gj . Cheng, McKay and Wang and Jouanolou have provided answers for two particular subcases. The main contribution of this paper is to complete these works by providing a uniform answer for all subcases. In short, it states that the dense resultant is the product of certain powers of the dense resultants of the component polynomials and of some of their leading forms. It is expected that these results can be applied to compute dense resultants of composed polynomials with improved efficiency. We also state a lemma of independent interest about the dense resultant under vanishing of leading forms.
منابع مشابه
Single-lifting Macaulay-type formulae of generalized unmixed sparse resultants
Resultants are defined in the sparse (or toric) context in order to exploit the structure of the polynomials as expressed by their Newton polytopes. Since determinantal formulae are not always possible, the most efficient general method for computing resultants is as the ratio of two determinants. This is made possible by Macaulay’s seminal result [15] in the dense homogeneous case, extended by...
متن کاملSparse Resultant of Composed Polynomials IMixed-. Unmixed Case
The main question of this paper is: What happens to sparse resultants under composition? More precisely, let f1, . . . , fn be homogeneous sparse polynomials in the variables y1, . . . , yn and g1, . . . , gn be homogeneous sparse polynomials in the variables x1, . . . , xn. Let fi ◦ (g1, . . . , gn) be the sparse homogeneous polynomial obtained from fi by replacing yj by gj . Naturally a quest...
متن کاملOn the Construction of Generic Mixed Cayley-Sylvester Resultant Matrix
For a generic n-degree polynomial system which contains n+1 polynomials in n variables, we give the construction of the generic mixed Cayley-Sylvester resultant matrix. There are n− 1 generic mixed Cayley-Sylvester resultant matrices between the classical Cayley resultant matrix and the classical Sylvester resultant matrix. The entries of these new resultant matrix are of degree m(1 < m < n + 1...
متن کاملOn the Complexity of Sparse Elimination
Sparse elimination exploits the structure of a set of multivariate polynomials by measuring complexity in terms of Newton polytopes. We examine polynomial systems that generate 0-dimensional ideals: a generic monomial basis for the coordinate ring of such a system is de ned from a mixed subdivision. We o er a simple proof of this known fact and relate the computation of a monomial basis to the ...
متن کاملOrthodontic Management of a Severely Rotated Maxillary Central Incisor in the Mixed Dentition: A Case Report
The aim of this case report was to introduce an appliance for correcting severe rotation of anterior teeth in the mixed dentition period. A 9-year-old Iranian boy with a mixed dentition Class I malocclusion complained of a severely rotated of upper right central incisor. There was a mesiodens between the central incisors. The supernumerary tooth was first extracted and then a Whip appliance whi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Comput.
دوره 36 شماره
صفحات -
تاریخ انتشار 2003